Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("68T05")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 183

  • Page / 8
Export

Selection :

  • and

THE FORGETRON : A KERNEL-BASED PERCEPTRON ON A BUDGETDEKEL, Ofer; SIIALEV-SHWARTZ, Shai; SINGER, Yoram et al.SIAM journal on computing (Print). 2008, Vol 37, Num 5, pp 1342-1372, issn 0097-5397, 31 p.Article

THE SPECTRAL METHOD FOR GENERAL MIXTURE MODELSKANNAN, Ravindran; SALMASIAN, Hadi; VEMPALA, Santosh et al.SIAM journal on computing (Print). 2009, Vol 38, Num 3, pp 1141-1156, issn 0097-5397, 16 p.Article

HARDNESS OF RECONSTRUCTING MULTIVARIATE POLYNOMIALS OVER FINITE FIELDS : Foundations of Computer ScienceGOPALAN, Parikshit; KHOT, Subhash; SAKET, Rishi et al.SIAM journal on computing (Print). 2010, Vol 39, Num 6, pp 2598-2621, issn 0097-5397, 24 p.Article

Hypothesis spaces for learningJAIN, Sanjay.Information and computation (Print). 2011, Vol 209, Num 3, pp 513-527, issn 0890-5401, 15 p.Conference Paper

Organisational adaptation of multi-agent systems in a peer-to-peer scenarioCAMPOS, Jordi; ESTEVA, Marc; LOPEZ-SANCHEZ, Maite et al.Computing (Wien. Print). 2011, Vol 91, Num 2, pp 169-215, issn 0010-485X, 47 p.Conference Paper

Some natural conditions on incremental learningJAIN, Sanjay; LANGE, Steffen; ZILLES, Sandra et al.Information and computation (Print). 2007, Vol 205, Num 11, pp 1671-1684, issn 0890-5401, 14 p.Article

LEARNING KERNEL-BASED HALFSPACES WITH THE 0-1 LOSSSHALEV-SHWARTZ, Shai; SHAMIR, Ohad; SRIDHARAN, Karthik et al.SIAM journal on computing (Print). 2011, Vol 40, Num 6, pp 1623-1646, issn 0097-5397, 24 p.Article

Boundedness of adaptive nets is decidableOANEA, Olivia.Information processing letters. 2011, Vol 111, Num 15, pp 738-743, issn 0020-0190, 6 p.Article

MITOTIC CLASSES IN INDUCTIVE INFERENCEJAIN, Sanjay; STEPHAN, Frank.SIAM journal on computing (Print). 2009, Vol 38, Num 4, pp 1283-1299, issn 0097-5397, 17 p.Article

Effective learning in the presence of adaptive counterpartsBURKOV, Andriy; CHAIB-DRAA, Brahim.Journal of algorithms (Print). 2009, Vol 64, Num 4, pp 127-138, issn 0196-6774, 12 p.Article

Results on memory-limited U-shaped learningCARLUCCI, Lorenzo; CASE, John; JAIN, Sanjay et al.Information and computation (Print). 2007, Vol 205, Num 10, pp 1551-1573, issn 0890-5401, 23 p.Article

Measuring teachability using variants of the teaching dimensionBALBACH, Frank J.Theoretical computer science. 2008, Vol 397, Num 1-3, pp 94-113, issn 0304-3975, 20 p.Article

MULTIVARIATE REGRESSION AND MACHINE LEARNING WITH SUMS OF SEPARABLE FUNCTIONSBEYLKIN, Gregory; GARCKE, Jochen; MOHLENKAMP, Martin J et al.SIAM journal on scientific computing (Print). 2010, Vol 31, Num 3, pp 1840-1857, issn 1064-8275, 18 p.Article

Learning languages from positive data and a limited number of short counterexamplesJAIN, Sanjay; KINBER, Efim.Theoretical computer science. 2007, Vol 389, Num 1-2, pp 190-218, issn 0304-3975, 29 p.Article

Parameterized learnability of juntasARVIND, V; KÖBLER, Johannes; LINDNER, Wolfgang et al.Theoretical computer science. 2009, Vol 410, Num 47-49, pp 4928-4936, issn 0304-3975, 9 p.Article

The learning effect : Getting to the core of the problemJANIAK, Adam; RUDEK, Radoslaw.Information processing letters. 2007, Vol 103, Num 5, pp 183-187, issn 0020-0190, 5 p.Article

On some open problems in monotonic and conservative learningJAIN, Sanjay.Information processing letters. 2009, Vol 109, Num 16, pp 923-926, issn 0020-0190, 4 p.Article

Reflective inductive inference of recursive functionsGRIESER, Gunter.Theoretical computer science. 2008, Vol 397, Num 1-3, pp 57-69, issn 0304-3975, 13 p.Article

Variations on U-shaped learningCARLUCCI, Lorenzo; JAIN, Sanjay; KINBER, Efim et al.Information and computation (Print). 2006, Vol 204, Num 8, pp 1264-1294, issn 0890-5401, 31 p.Article

Leabning random log-depth decision trees under uniform distributionJACKSON, Jeffrey C; SERVEDIO, Rocco A.SIAM journal on computing (Print). 2005, Vol 34, Num 5, pp 1107-1128, issn 0097-5397, 22 p.Article

LEARNING MONOTONE DECISION TREES IN POLYNOMIAL TIMEO'DONNELL, Ryan; SERVEDIO, Rocco A.SIAM journal on computing (Print). 2008, Vol 37, Num 3, pp 827-844, issn 0097-5397, 18 p.Article

Improved artificial bee colony algorithm for global optimizationWEIFENG GAO; SANYANG LIU.Information processing letters. 2011, Vol 111, Num 17, pp 871-882, issn 0020-0190, 12 p.Article

The regularized least squares algorithm and the problem of learning halfspacesMINH, Ha Quang.Information processing letters. 2011, Vol 111, Num 8, pp 395-401, issn 0020-0190, 7 p.Article

On clonal selectionMCEWAN, Chris; HART, Emma.Theoretical computer science. 2011, Vol 412, Num 6, pp 502-516, issn 0304-3975, 15 p.Article

Analysis of Convertible Bond Value Based on Integration of Support Vector Machine and Copula FunctionCHUANHE SHEN; XIANGRONG WANG.Communications in statistics. Simulation and computation. 2011, Vol 40, Num 8-10, pp 1563-1575, issn 0361-0918, 13 p.Conference Paper

  • Page / 8